Polygonal chain approximation: a query based approach
نویسندگان
چکیده
منابع مشابه
Polygonal chain approximation: a query based approach
In this paper we present a new, query based approach for approximating polygonal chains in the plane. We give a few results based on this approach, some of more general interest, and propose a greedy heuristic to speed up the computation. Our algorithms are simple, based on standard geometric operations, and thus suitable for efficient implementation. We also show that the query based approach ...
متن کاملA Split-Merge-Split Approach to Polygonal Approximation of Chain-Coded Curve
This paper proposes a technique for polygonal approximation of chain-coded curve after relaxing the definition of digital straight segment. The initial approximation is modified by merging quasi linear vertices followed by insertion of additional vertices. The entire process involves comparison and computation on integral domain. It uses an approximation of perpendicular distance which is shown...
متن کاملA novel approach to polygonal approximation of digital curves
A new approach to polygonal approximation is presented in this paper. It starts from an initial set of dominant points (break points), where the integral square error from a given shape is zero. The proposed algorithm iteratively deletes most redundant dominant points till required approximation is achieved. Stabilization algorithm after elimination of each dominant point ensures high quality o...
متن کاملPolygonal Approximation Based on Multi-Objective Optimization
In order to solve multiple constraints in the existing polygonal approximation algorithms of digital curves, a new algorithm is proposed in this article. Each control constraint is taken as the optimization objective respectively and the idea of multi-objective optimization is also applied. Vertex positions of the intermediate approximation polygon are represented by a binary sequence, and Hamm...
متن کاملComponent-based polygonal approximation of soft objects
We propose a new polygonal approximation method for soft objects. While the conventional polygonization methods decompose space into small-sized cells and compute many pieces of polygons for the cells, this new method polygonizes a soft object by smoothing an initial polygonal approximation using subdivision surface schemes. The initial polygonal approximation is generated by the union of the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2005
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.07.001